Kostant–Toda lattices and the universal centralizer

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On residuated lattices with universal quantifiers

We consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $X$, $(X, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $X$. We also show that, for a strong residuated lattice $X$, $bigcap {P_{lambda} ,|,P_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

Universal codes and unimodular lattices

Binary quadratic residue codes of length p + 1 produce via construction B and density doubling type II lattices like the Leech. Recently, quaternary quadratic residue codes have been shown to produce the same lattices by construction A modulo 4. We prove in a direct way the equivalence of these two constructions for p ~ 31. In dimension 32, we obtain an extremal lattice of type II not isometric...

متن کامل

on residuated lattices with universal quantifiers

we consider properties of residuated lattices with universal quantifier and show that, for a residuated lattice $x$, $(x, forall)$ is a residuated lattice with a quantifier if and only if there is an $m$-relatively complete substructure of $x$. we also show that, for a strong residuated lattice $x$, $bigcap {p_{lambda} ,|,p_{lambda} {rm is an} m{rm -filter} } = {1}$ and hence that any strong re...

متن کامل

Universal lattices and unbounded rank expanders

We study the representations of non-commutative universal lattices and use them to compute lower bounds for the τ -constant for the commutative universal lattices Gd,k = SLd(Z[x1, . . . , xk]) with respect to several generating sets. As an application of the above result we show that the Cayley graphs of the finite groups SL3k(Fp) can be made expanders using suitable choice of the generators. T...

متن کامل

Site percolation thresholds and universal formulas for the Archimedean lattices

The site percolation thresholds pc are determined to high precision for eight Archimedean lattices, by the hull-walk gradient-percolation simulation technique, with the results pc = 0.697 043, honeycomb or (6 ), 0.807 904 (3, 12), 0.747 806 (4, 6, 12), 0.729 724 (4, 8), 0.579 498 (3, 6), 0.621 819 (3, 4, 6, 4), 0.550 213 (3, 4), and 0.550 806 (3, 4, 3, 4), and errors of about ±2 × 10. (The rema...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Geometry and Physics

سال: 2020

ISSN: 0393-0440

DOI: 10.1016/j.geomphys.2020.103595